Local chromatic number and Sperner capacity
نویسندگان
چکیده
منابع مشابه
The Linear Chromatic Number of Sperner Families
Let S be a set with m elements and S a complete Sperner family on S, i.e. a Sperner family such that every x ∈ S is contained in some member of S. The linear chromatic number of S, defined by Civan, is the smallest integer n with the property that there exists a function f : S → {1, . . . , n} such that if f(x) = f(y), then every set in S which contains x also contains y, or every set in S whic...
متن کاملThe linear chromatic number of a Sperner family
Let S be a finite set and S a complete Sperner family on S, i.e. a Sperner family such that every x ∈ S is contained in some member of S. The linear chromatic number of S, defined by Cıvan, is the smallest integer n with the property that there exists a function f : S → {1, . . . , n} such that if f(x) = f(y), then every set in S which contains x also contains y or every set in S which contains...
متن کاملLocal chromatic number of quadrangulations of surfaces
The local chromatic number of a graph G, as introduced in [4], is the minimum integer k such that G admits a proper coloring (with an arbitrary number of colors) in which the neighborhood of each vertex uses less than k colors. In [17] a connection of the local chromatic number to topological properties of (a box complex of) the graph was established and in [18] it was shown that a topological ...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملLocal chromatic number and topological properties of graphs ( Extended abstract )
The local chromatic number of a graph, introduced by Erdős et al. in (4), is the minimum number of colors that must appear in the closed neighborhood of some vertex in any proper coloring of the graph. This talk, based on the papers (14; 15; 16), would like to survey some of our recent results on this parameter. We give a lower bound for the local chromatic number in terms of the lower bound of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2005
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2005.03.006